On Finding Query Rewritings under Expressive Constraints

We study a general framework for query rewriting in the presence of general FOL constraints, where standard theorem proving techniques (e.g., tableau or resolution) can be used. The novel results of applying this framework include: 1) if the original constraints are domain independent, then so will be the query rewritten in terms of database predicates; 2) for infinite databases, the rewriting of conjunctive queries over connected views is decidable; 3) one can apply this technique to the guarded fragment of FOL, obtaining results about ontology languages.